Satisfiability of CTL* with Constraints
نویسندگان
چکیده
We show that satisfiability for CTL∗ with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL∗, e.g., the existential and positive fragments and EF.
منابع مشابه
Satisfiability of ECTL⁎ with constraints
We show that satisfiability and finite satisfiability for ECTL with equality-, order-, and modulo-constraints over Z are decidable. Since ECTL is a proper extension of CTL this greatly improves the previously known decidability results for certain fragments of CTL, e.g., the existential and positive fragments and EF. We also show that our choice of local constraints is necessary for the result ...
متن کاملBranching-Time Temporal Logic Extended with Qualitative Presburger Constraints
Recently, LTL extended with atomic formulas built over a constraint language interpreting variables in Z has been shown to have a decidable satisfiability and model-checking problem. This language allows to compare the variables at different states of the model and include periodicity constraints, comparison constraints, and a restricted form of quantification. On the other hand, the CTL counte...
متن کاملTemporal Logics with Local Constraints ∗
Recent decidability results on the satisfiability problem for temporal logics, in particular LTL, CTL∗ and ECTL∗, with constraints over external structures like the integers with the order or infinite trees are surveyed in this paper. 1998 ACM Subject Classification F.4.1 Mathematical Logic
متن کاملEquivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic
We show that model-checking flat counter systems over CTL* (with arithmetical constraints on counter values) has the same complexity as the satisfiability problem for Presburger arithmetic. The lower bound already holds with the temporal operator EF only, no arithmetical constraints in the logical language and with guards on transitions made of simple linear constraints. This complements our un...
متن کاملCTL+ Is Complete for Double Exponential Time
We show that the satisfiability problem for CTL, the branching time logic that allows boolean combinations of path formulas inside a path quantifier but no nesting of them, is 2-EXPTIME-hard. The construction is inspired by Vardi and Stockmeyer’s 2-EXPTIME-hardness proof of CTL∗’s satisfiability problem. As a consequence, there is no subexponential reduction from CTL to CTL which preserves sati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013